Jacobi Polynomial Expansions of a Generalized Hypergeometric Function over a Semi-Infinite Ray
نویسندگان
چکیده
منابع مشابه
Maximal Operators Associated with Generalized Hermite Polynomial and Function Expansions
We study the weak and strong type boundedness of maximal heat–diffusion operators associated with the system of generalized Hermite polynomials and with two different systems of generalized Hermite functions. We also give a necessary background to define Sobolev spaces in this context.
متن کاملPolynomial series expansions for confluent and Gaussian hypergeometric functions
Based on the Hadamard product of power series, polynomial series expansions for confluent hypergeometric functions M(a, c; ·) and for Gaussian hypergeometric functions F (a, b; c; ·) are introduced and studied. It turns out that the partial sums provide an interesting alternative for the numerical evaluation of the functions M(a, c; ·) and F (a, b; c; ·), in particular, if the parameters are al...
متن کاملAn Extended Gamma Function Involving a Generalized Hypergeometric Function
The objective of this paper is to define and study new generalized extended gamma functions. A generalized extended gamma probability density function involving generalized hypergeometric function is also defined. Closed form representations of the generalized gamma functions and the moment generating function are derived in the form of H-function using inverse Mellon transform techniques. Inco...
متن کاملA General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کاملAn algorithm for semi-infinite polynomial optimization
We consider the semi-infinite optimization problem: f := min x∈X {f(x) : g(x,y) ≤ 0, ∀y ∈ Yx }, where f, g are polynomials and X ⊂ R as well as Yx ⊂ R , x ∈ X, are compact basic semi-algebraic sets. To approximate f we proceed in two steps. First, we use the “joint+marginal” approach of the author [9] to approximate from above the function x 7→ Φ(x) = sup{g(x,y) : y ∈ Yx} by a polynomial Φd ≥ Φ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1963
ISSN: 0025-5718
DOI: 10.2307/2004000